Dynamic asynchronous iterations

Many problems can be solved by iteration multiple participants (processors, servers, routers etc.). Previous mathematical models for such asynchronous iterations assume a single function being iterated fixed set of participants. We will call static since the system's configuration does not change. However in several real-world examples, as inter-domain routing, both and change frequently while system continues to function. In this paper we extend Üresin Dubois's work on develop model class dynamic or always iterations. explore what it means an implemented correctly, then prove two different conditions functions that guarantee full satisfies new definition correctness. These results have been formalised Agda resulting library is publicly available.